<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    package org.apache.commons.math3.geometry.partitioning.utilities;<a name="line.17"></a>
<FONT color="green">018</FONT>    <a name="line.18"></a>
<FONT color="green">019</FONT>    /** This class implements AVL trees.<a name="line.19"></a>
<FONT color="green">020</FONT>     *<a name="line.20"></a>
<FONT color="green">021</FONT>     * &lt;p&gt;The purpose of this class is to sort elements while allowing<a name="line.21"></a>
<FONT color="green">022</FONT>     * duplicate elements (i.e. such that {@code a.equals(b)} is<a name="line.22"></a>
<FONT color="green">023</FONT>     * true). The {@code SortedSet} interface does not allow this, so<a name="line.23"></a>
<FONT color="green">024</FONT>     * a specific class is needed. Null elements are not allowed.&lt;/p&gt;<a name="line.24"></a>
<FONT color="green">025</FONT>     *<a name="line.25"></a>
<FONT color="green">026</FONT>     * &lt;p&gt;Since the {@code equals} method is not sufficient to<a name="line.26"></a>
<FONT color="green">027</FONT>     * differentiate elements, the {@link #delete delete} method is<a name="line.27"></a>
<FONT color="green">028</FONT>     * implemented using the equality operator.&lt;/p&gt;<a name="line.28"></a>
<FONT color="green">029</FONT>     *<a name="line.29"></a>
<FONT color="green">030</FONT>     * &lt;p&gt;In order to clearly mark the methods provided here do not have<a name="line.30"></a>
<FONT color="green">031</FONT>     * the same semantics as the ones specified in the<a name="line.31"></a>
<FONT color="green">032</FONT>     * {@code SortedSet} interface, different names are used<a name="line.32"></a>
<FONT color="green">033</FONT>     * ({@code add} has been replaced by {@link #insert insert} and<a name="line.33"></a>
<FONT color="green">034</FONT>     * {@code remove} has been replaced by {@link #delete<a name="line.34"></a>
<FONT color="green">035</FONT>     * delete}).&lt;/p&gt;<a name="line.35"></a>
<FONT color="green">036</FONT>     *<a name="line.36"></a>
<FONT color="green">037</FONT>     * &lt;p&gt;This class is based on the C implementation Georg Kraml has put<a name="line.37"></a>
<FONT color="green">038</FONT>     * in the public domain. Unfortunately, his &lt;a<a name="line.38"></a>
<FONT color="green">039</FONT>     * href="www.purists.org/georg/avltree/index.html"&gt;page&lt;/a&gt; seems not<a name="line.39"></a>
<FONT color="green">040</FONT>     * to exist any more.&lt;/p&gt;<a name="line.40"></a>
<FONT color="green">041</FONT>     *<a name="line.41"></a>
<FONT color="green">042</FONT>     * @param &lt;T&gt; the type of the elements<a name="line.42"></a>
<FONT color="green">043</FONT>     *<a name="line.43"></a>
<FONT color="green">044</FONT>     * @version $Id: AVLTree.java 1416643 2012-12-03 19:37:14Z tn $<a name="line.44"></a>
<FONT color="green">045</FONT>     * @since 3.0<a name="line.45"></a>
<FONT color="green">046</FONT>     */<a name="line.46"></a>
<FONT color="green">047</FONT>    public class AVLTree&lt;T extends Comparable&lt;T&gt;&gt; {<a name="line.47"></a>
<FONT color="green">048</FONT>    <a name="line.48"></a>
<FONT color="green">049</FONT>        /** Top level node. */<a name="line.49"></a>
<FONT color="green">050</FONT>        private Node top;<a name="line.50"></a>
<FONT color="green">051</FONT>    <a name="line.51"></a>
<FONT color="green">052</FONT>        /** Build an empty tree.<a name="line.52"></a>
<FONT color="green">053</FONT>         */<a name="line.53"></a>
<FONT color="green">054</FONT>        public AVLTree() {<a name="line.54"></a>
<FONT color="green">055</FONT>            top = null;<a name="line.55"></a>
<FONT color="green">056</FONT>        }<a name="line.56"></a>
<FONT color="green">057</FONT>    <a name="line.57"></a>
<FONT color="green">058</FONT>        /** Insert an element in the tree.<a name="line.58"></a>
<FONT color="green">059</FONT>         * @param element element to insert (silently ignored if null)<a name="line.59"></a>
<FONT color="green">060</FONT>         */<a name="line.60"></a>
<FONT color="green">061</FONT>        public void insert(final T element) {<a name="line.61"></a>
<FONT color="green">062</FONT>            if (element != null) {<a name="line.62"></a>
<FONT color="green">063</FONT>                if (top == null) {<a name="line.63"></a>
<FONT color="green">064</FONT>                    top = new Node(element, null);<a name="line.64"></a>
<FONT color="green">065</FONT>                } else {<a name="line.65"></a>
<FONT color="green">066</FONT>                    top.insert(element);<a name="line.66"></a>
<FONT color="green">067</FONT>                }<a name="line.67"></a>
<FONT color="green">068</FONT>            }<a name="line.68"></a>
<FONT color="green">069</FONT>        }<a name="line.69"></a>
<FONT color="green">070</FONT>    <a name="line.70"></a>
<FONT color="green">071</FONT>        /** Delete an element from the tree.<a name="line.71"></a>
<FONT color="green">072</FONT>         * &lt;p&gt;The element is deleted only if there is a node {@code n}<a name="line.72"></a>
<FONT color="green">073</FONT>         * containing exactly the element instance specified, i.e. for which<a name="line.73"></a>
<FONT color="green">074</FONT>         * {@code n.getElement() == element}. This is purposely<a name="line.74"></a>
<FONT color="green">075</FONT>         * &lt;em&gt;different&lt;/em&gt; from the specification of the<a name="line.75"></a>
<FONT color="green">076</FONT>         * {@code java.util.Set} {@code remove} method (in fact,<a name="line.76"></a>
<FONT color="green">077</FONT>         * this is the reason why a specific class has been developed).&lt;/p&gt;<a name="line.77"></a>
<FONT color="green">078</FONT>         * @param element element to delete (silently ignored if null)<a name="line.78"></a>
<FONT color="green">079</FONT>         * @return true if the element was deleted from the tree<a name="line.79"></a>
<FONT color="green">080</FONT>         */<a name="line.80"></a>
<FONT color="green">081</FONT>        public boolean delete(final T element) {<a name="line.81"></a>
<FONT color="green">082</FONT>            if (element != null) {<a name="line.82"></a>
<FONT color="green">083</FONT>                for (Node node = getNotSmaller(element); node != null; node = node.getNext()) {<a name="line.83"></a>
<FONT color="green">084</FONT>                    // loop over all elements neither smaller nor larger<a name="line.84"></a>
<FONT color="green">085</FONT>                    // than the specified one<a name="line.85"></a>
<FONT color="green">086</FONT>                    if (node.element == element) {<a name="line.86"></a>
<FONT color="green">087</FONT>                        node.delete();<a name="line.87"></a>
<FONT color="green">088</FONT>                        return true;<a name="line.88"></a>
<FONT color="green">089</FONT>                    } else if (node.element.compareTo(element) &gt; 0) {<a name="line.89"></a>
<FONT color="green">090</FONT>                        // all the remaining elements are known to be larger,<a name="line.90"></a>
<FONT color="green">091</FONT>                        // the element is not in the tree<a name="line.91"></a>
<FONT color="green">092</FONT>                        return false;<a name="line.92"></a>
<FONT color="green">093</FONT>                    }<a name="line.93"></a>
<FONT color="green">094</FONT>                }<a name="line.94"></a>
<FONT color="green">095</FONT>            }<a name="line.95"></a>
<FONT color="green">096</FONT>            return false;<a name="line.96"></a>
<FONT color="green">097</FONT>        }<a name="line.97"></a>
<FONT color="green">098</FONT>    <a name="line.98"></a>
<FONT color="green">099</FONT>        /** Check if the tree is empty.<a name="line.99"></a>
<FONT color="green">100</FONT>         * @return true if the tree is empty<a name="line.100"></a>
<FONT color="green">101</FONT>         */<a name="line.101"></a>
<FONT color="green">102</FONT>        public boolean isEmpty() {<a name="line.102"></a>
<FONT color="green">103</FONT>            return top == null;<a name="line.103"></a>
<FONT color="green">104</FONT>        }<a name="line.104"></a>
<FONT color="green">105</FONT>    <a name="line.105"></a>
<FONT color="green">106</FONT>    <a name="line.106"></a>
<FONT color="green">107</FONT>        /** Get the number of elements of the tree.<a name="line.107"></a>
<FONT color="green">108</FONT>         * @return number of elements contained in the tree<a name="line.108"></a>
<FONT color="green">109</FONT>         */<a name="line.109"></a>
<FONT color="green">110</FONT>        public int size() {<a name="line.110"></a>
<FONT color="green">111</FONT>            return (top == null) ? 0 : top.size();<a name="line.111"></a>
<FONT color="green">112</FONT>        }<a name="line.112"></a>
<FONT color="green">113</FONT>    <a name="line.113"></a>
<FONT color="green">114</FONT>        /** Get the node whose element is the smallest one in the tree.<a name="line.114"></a>
<FONT color="green">115</FONT>         * @return the tree node containing the smallest element in the tree<a name="line.115"></a>
<FONT color="green">116</FONT>         * or null if the tree is empty<a name="line.116"></a>
<FONT color="green">117</FONT>         * @see #getLargest<a name="line.117"></a>
<FONT color="green">118</FONT>         * @see #getNotSmaller<a name="line.118"></a>
<FONT color="green">119</FONT>         * @see #getNotLarger<a name="line.119"></a>
<FONT color="green">120</FONT>         * @see Node#getPrevious<a name="line.120"></a>
<FONT color="green">121</FONT>         * @see Node#getNext<a name="line.121"></a>
<FONT color="green">122</FONT>         */<a name="line.122"></a>
<FONT color="green">123</FONT>        public Node getSmallest() {<a name="line.123"></a>
<FONT color="green">124</FONT>            return (top == null) ? null : top.getSmallest();<a name="line.124"></a>
<FONT color="green">125</FONT>        }<a name="line.125"></a>
<FONT color="green">126</FONT>    <a name="line.126"></a>
<FONT color="green">127</FONT>        /** Get the node whose element is the largest one in the tree.<a name="line.127"></a>
<FONT color="green">128</FONT>         * @return the tree node containing the largest element in the tree<a name="line.128"></a>
<FONT color="green">129</FONT>         * or null if the tree is empty<a name="line.129"></a>
<FONT color="green">130</FONT>         * @see #getSmallest<a name="line.130"></a>
<FONT color="green">131</FONT>         * @see #getNotSmaller<a name="line.131"></a>
<FONT color="green">132</FONT>         * @see #getNotLarger<a name="line.132"></a>
<FONT color="green">133</FONT>         * @see Node#getPrevious<a name="line.133"></a>
<FONT color="green">134</FONT>         * @see Node#getNext<a name="line.134"></a>
<FONT color="green">135</FONT>         */<a name="line.135"></a>
<FONT color="green">136</FONT>        public Node getLargest() {<a name="line.136"></a>
<FONT color="green">137</FONT>            return (top == null) ? null : top.getLargest();<a name="line.137"></a>
<FONT color="green">138</FONT>        }<a name="line.138"></a>
<FONT color="green">139</FONT>    <a name="line.139"></a>
<FONT color="green">140</FONT>        /** Get the node whose element is not smaller than the reference object.<a name="line.140"></a>
<FONT color="green">141</FONT>         * @param reference reference object (may not be in the tree)<a name="line.141"></a>
<FONT color="green">142</FONT>         * @return the tree node containing the smallest element not smaller<a name="line.142"></a>
<FONT color="green">143</FONT>         * than the reference object or null if either the tree is empty or<a name="line.143"></a>
<FONT color="green">144</FONT>         * all its elements are smaller than the reference object<a name="line.144"></a>
<FONT color="green">145</FONT>         * @see #getSmallest<a name="line.145"></a>
<FONT color="green">146</FONT>         * @see #getLargest<a name="line.146"></a>
<FONT color="green">147</FONT>         * @see #getNotLarger<a name="line.147"></a>
<FONT color="green">148</FONT>         * @see Node#getPrevious<a name="line.148"></a>
<FONT color="green">149</FONT>         * @see Node#getNext<a name="line.149"></a>
<FONT color="green">150</FONT>         */<a name="line.150"></a>
<FONT color="green">151</FONT>        public Node getNotSmaller(final T reference) {<a name="line.151"></a>
<FONT color="green">152</FONT>            Node candidate = null;<a name="line.152"></a>
<FONT color="green">153</FONT>            for (Node node = top; node != null;) {<a name="line.153"></a>
<FONT color="green">154</FONT>                if (node.element.compareTo(reference) &lt; 0) {<a name="line.154"></a>
<FONT color="green">155</FONT>                    if (node.right == null) {<a name="line.155"></a>
<FONT color="green">156</FONT>                        return candidate;<a name="line.156"></a>
<FONT color="green">157</FONT>                    }<a name="line.157"></a>
<FONT color="green">158</FONT>                    node = node.right;<a name="line.158"></a>
<FONT color="green">159</FONT>                } else {<a name="line.159"></a>
<FONT color="green">160</FONT>                    candidate = node;<a name="line.160"></a>
<FONT color="green">161</FONT>                    if (node.left == null) {<a name="line.161"></a>
<FONT color="green">162</FONT>                        return candidate;<a name="line.162"></a>
<FONT color="green">163</FONT>                    }<a name="line.163"></a>
<FONT color="green">164</FONT>                    node = node.left;<a name="line.164"></a>
<FONT color="green">165</FONT>                }<a name="line.165"></a>
<FONT color="green">166</FONT>            }<a name="line.166"></a>
<FONT color="green">167</FONT>            return null;<a name="line.167"></a>
<FONT color="green">168</FONT>        }<a name="line.168"></a>
<FONT color="green">169</FONT>    <a name="line.169"></a>
<FONT color="green">170</FONT>        /** Get the node whose element is not larger than the reference object.<a name="line.170"></a>
<FONT color="green">171</FONT>         * @param reference reference object (may not be in the tree)<a name="line.171"></a>
<FONT color="green">172</FONT>         * @return the tree node containing the largest element not larger<a name="line.172"></a>
<FONT color="green">173</FONT>         * than the reference object (in which case the node is guaranteed<a name="line.173"></a>
<FONT color="green">174</FONT>         * not to be empty) or null if either the tree is empty or all its<a name="line.174"></a>
<FONT color="green">175</FONT>         * elements are larger than the reference object<a name="line.175"></a>
<FONT color="green">176</FONT>         * @see #getSmallest<a name="line.176"></a>
<FONT color="green">177</FONT>         * @see #getLargest<a name="line.177"></a>
<FONT color="green">178</FONT>         * @see #getNotSmaller<a name="line.178"></a>
<FONT color="green">179</FONT>         * @see Node#getPrevious<a name="line.179"></a>
<FONT color="green">180</FONT>         * @see Node#getNext<a name="line.180"></a>
<FONT color="green">181</FONT>         */<a name="line.181"></a>
<FONT color="green">182</FONT>        public Node getNotLarger(final T reference) {<a name="line.182"></a>
<FONT color="green">183</FONT>            Node candidate = null;<a name="line.183"></a>
<FONT color="green">184</FONT>            for (Node node = top; node != null;) {<a name="line.184"></a>
<FONT color="green">185</FONT>                if (node.element.compareTo(reference) &gt; 0) {<a name="line.185"></a>
<FONT color="green">186</FONT>                    if (node.left == null) {<a name="line.186"></a>
<FONT color="green">187</FONT>                        return candidate;<a name="line.187"></a>
<FONT color="green">188</FONT>                    }<a name="line.188"></a>
<FONT color="green">189</FONT>                    node = node.left;<a name="line.189"></a>
<FONT color="green">190</FONT>                } else {<a name="line.190"></a>
<FONT color="green">191</FONT>                    candidate = node;<a name="line.191"></a>
<FONT color="green">192</FONT>                    if (node.right == null) {<a name="line.192"></a>
<FONT color="green">193</FONT>                        return candidate;<a name="line.193"></a>
<FONT color="green">194</FONT>                    }<a name="line.194"></a>
<FONT color="green">195</FONT>                    node = node.right;<a name="line.195"></a>
<FONT color="green">196</FONT>                }<a name="line.196"></a>
<FONT color="green">197</FONT>            }<a name="line.197"></a>
<FONT color="green">198</FONT>            return null;<a name="line.198"></a>
<FONT color="green">199</FONT>        }<a name="line.199"></a>
<FONT color="green">200</FONT>    <a name="line.200"></a>
<FONT color="green">201</FONT>        /** Enum for tree skew factor. */<a name="line.201"></a>
<FONT color="green">202</FONT>        private static enum Skew {<a name="line.202"></a>
<FONT color="green">203</FONT>            /** Code for left high trees. */<a name="line.203"></a>
<FONT color="green">204</FONT>            LEFT_HIGH,<a name="line.204"></a>
<FONT color="green">205</FONT>    <a name="line.205"></a>
<FONT color="green">206</FONT>            /** Code for right high trees. */<a name="line.206"></a>
<FONT color="green">207</FONT>            RIGHT_HIGH,<a name="line.207"></a>
<FONT color="green">208</FONT>    <a name="line.208"></a>
<FONT color="green">209</FONT>            /** Code for Skew.BALANCED trees. */<a name="line.209"></a>
<FONT color="green">210</FONT>            BALANCED;<a name="line.210"></a>
<FONT color="green">211</FONT>        }<a name="line.211"></a>
<FONT color="green">212</FONT>    <a name="line.212"></a>
<FONT color="green">213</FONT>        /** This class implements AVL trees nodes.<a name="line.213"></a>
<FONT color="green">214</FONT>         * &lt;p&gt;AVL tree nodes implement all the logical structure of the<a name="line.214"></a>
<FONT color="green">215</FONT>         * tree. Nodes are created by the {@link AVLTree AVLTree} class.&lt;/p&gt;<a name="line.215"></a>
<FONT color="green">216</FONT>         * &lt;p&gt;The nodes are not independant from each other but must obey<a name="line.216"></a>
<FONT color="green">217</FONT>         * specific balancing constraints and the tree structure is<a name="line.217"></a>
<FONT color="green">218</FONT>         * rearranged as elements are inserted or deleted from the tree. The<a name="line.218"></a>
<FONT color="green">219</FONT>         * creation, modification and tree-related navigation methods have<a name="line.219"></a>
<FONT color="green">220</FONT>         * therefore restricted access. Only the order-related navigation,<a name="line.220"></a>
<FONT color="green">221</FONT>         * reading and delete methods are public.&lt;/p&gt;<a name="line.221"></a>
<FONT color="green">222</FONT>         * @see AVLTree<a name="line.222"></a>
<FONT color="green">223</FONT>         */<a name="line.223"></a>
<FONT color="green">224</FONT>        public class Node {<a name="line.224"></a>
<FONT color="green">225</FONT>    <a name="line.225"></a>
<FONT color="green">226</FONT>            /** Element contained in the current node. */<a name="line.226"></a>
<FONT color="green">227</FONT>            private T element;<a name="line.227"></a>
<FONT color="green">228</FONT>    <a name="line.228"></a>
<FONT color="green">229</FONT>            /** Left sub-tree. */<a name="line.229"></a>
<FONT color="green">230</FONT>            private Node left;<a name="line.230"></a>
<FONT color="green">231</FONT>    <a name="line.231"></a>
<FONT color="green">232</FONT>            /** Right sub-tree. */<a name="line.232"></a>
<FONT color="green">233</FONT>            private Node right;<a name="line.233"></a>
<FONT color="green">234</FONT>    <a name="line.234"></a>
<FONT color="green">235</FONT>            /** Parent tree. */<a name="line.235"></a>
<FONT color="green">236</FONT>            private Node parent;<a name="line.236"></a>
<FONT color="green">237</FONT>    <a name="line.237"></a>
<FONT color="green">238</FONT>            /** Skew factor. */<a name="line.238"></a>
<FONT color="green">239</FONT>            private Skew skew;<a name="line.239"></a>
<FONT color="green">240</FONT>    <a name="line.240"></a>
<FONT color="green">241</FONT>            /** Build a node for a specified element.<a name="line.241"></a>
<FONT color="green">242</FONT>             * @param element element<a name="line.242"></a>
<FONT color="green">243</FONT>             * @param parent parent node<a name="line.243"></a>
<FONT color="green">244</FONT>             */<a name="line.244"></a>
<FONT color="green">245</FONT>            Node(final T element, final Node parent) {<a name="line.245"></a>
<FONT color="green">246</FONT>                this.element = element;<a name="line.246"></a>
<FONT color="green">247</FONT>                left         = null;<a name="line.247"></a>
<FONT color="green">248</FONT>                right        = null;<a name="line.248"></a>
<FONT color="green">249</FONT>                this.parent  = parent;<a name="line.249"></a>
<FONT color="green">250</FONT>                skew         = Skew.BALANCED;<a name="line.250"></a>
<FONT color="green">251</FONT>            }<a name="line.251"></a>
<FONT color="green">252</FONT>    <a name="line.252"></a>
<FONT color="green">253</FONT>            /** Get the contained element.<a name="line.253"></a>
<FONT color="green">254</FONT>             * @return element contained in the node<a name="line.254"></a>
<FONT color="green">255</FONT>             */<a name="line.255"></a>
<FONT color="green">256</FONT>            public T getElement() {<a name="line.256"></a>
<FONT color="green">257</FONT>                return element;<a name="line.257"></a>
<FONT color="green">258</FONT>            }<a name="line.258"></a>
<FONT color="green">259</FONT>    <a name="line.259"></a>
<FONT color="green">260</FONT>            /** Get the number of elements of the tree rooted at this node.<a name="line.260"></a>
<FONT color="green">261</FONT>             * @return number of elements contained in the tree rooted at this node<a name="line.261"></a>
<FONT color="green">262</FONT>             */<a name="line.262"></a>
<FONT color="green">263</FONT>            int size() {<a name="line.263"></a>
<FONT color="green">264</FONT>                return 1 + ((left  == null) ? 0 : left.size()) + ((right == null) ? 0 : right.size());<a name="line.264"></a>
<FONT color="green">265</FONT>            }<a name="line.265"></a>
<FONT color="green">266</FONT>    <a name="line.266"></a>
<FONT color="green">267</FONT>            /** Get the node whose element is the smallest one in the tree<a name="line.267"></a>
<FONT color="green">268</FONT>             * rooted at this node.<a name="line.268"></a>
<FONT color="green">269</FONT>             * @return the tree node containing the smallest element in the<a name="line.269"></a>
<FONT color="green">270</FONT>             * tree rooted at this node or null if the tree is empty<a name="line.270"></a>
<FONT color="green">271</FONT>             * @see #getLargest<a name="line.271"></a>
<FONT color="green">272</FONT>             */<a name="line.272"></a>
<FONT color="green">273</FONT>            Node getSmallest() {<a name="line.273"></a>
<FONT color="green">274</FONT>                Node node = this;<a name="line.274"></a>
<FONT color="green">275</FONT>                while (node.left != null) {<a name="line.275"></a>
<FONT color="green">276</FONT>                    node = node.left;<a name="line.276"></a>
<FONT color="green">277</FONT>                }<a name="line.277"></a>
<FONT color="green">278</FONT>                return node;<a name="line.278"></a>
<FONT color="green">279</FONT>            }<a name="line.279"></a>
<FONT color="green">280</FONT>    <a name="line.280"></a>
<FONT color="green">281</FONT>            /** Get the node whose element is the largest one in the tree<a name="line.281"></a>
<FONT color="green">282</FONT>             * rooted at this node.<a name="line.282"></a>
<FONT color="green">283</FONT>             * @return the tree node containing the largest element in the<a name="line.283"></a>
<FONT color="green">284</FONT>             * tree rooted at this node or null if the tree is empty<a name="line.284"></a>
<FONT color="green">285</FONT>             * @see #getSmallest<a name="line.285"></a>
<FONT color="green">286</FONT>             */<a name="line.286"></a>
<FONT color="green">287</FONT>            Node getLargest() {<a name="line.287"></a>
<FONT color="green">288</FONT>                Node node = this;<a name="line.288"></a>
<FONT color="green">289</FONT>                while (node.right != null) {<a name="line.289"></a>
<FONT color="green">290</FONT>                    node = node.right;<a name="line.290"></a>
<FONT color="green">291</FONT>                }<a name="line.291"></a>
<FONT color="green">292</FONT>                return node;<a name="line.292"></a>
<FONT color="green">293</FONT>            }<a name="line.293"></a>
<FONT color="green">294</FONT>    <a name="line.294"></a>
<FONT color="green">295</FONT>            /** Get the node containing the next smaller or equal element.<a name="line.295"></a>
<FONT color="green">296</FONT>             * @return node containing the next smaller or equal element or<a name="line.296"></a>
<FONT color="green">297</FONT>             * null if there is no smaller or equal element in the tree<a name="line.297"></a>
<FONT color="green">298</FONT>             * @see #getNext<a name="line.298"></a>
<FONT color="green">299</FONT>             */<a name="line.299"></a>
<FONT color="green">300</FONT>            public Node getPrevious() {<a name="line.300"></a>
<FONT color="green">301</FONT>    <a name="line.301"></a>
<FONT color="green">302</FONT>                if (left != null) {<a name="line.302"></a>
<FONT color="green">303</FONT>                    final Node node = left.getLargest();<a name="line.303"></a>
<FONT color="green">304</FONT>                    if (node != null) {<a name="line.304"></a>
<FONT color="green">305</FONT>                        return node;<a name="line.305"></a>
<FONT color="green">306</FONT>                    }<a name="line.306"></a>
<FONT color="green">307</FONT>                }<a name="line.307"></a>
<FONT color="green">308</FONT>    <a name="line.308"></a>
<FONT color="green">309</FONT>                for (Node node = this; node.parent != null; node = node.parent) {<a name="line.309"></a>
<FONT color="green">310</FONT>                    if (node != node.parent.left) {<a name="line.310"></a>
<FONT color="green">311</FONT>                        return node.parent;<a name="line.311"></a>
<FONT color="green">312</FONT>                    }<a name="line.312"></a>
<FONT color="green">313</FONT>                }<a name="line.313"></a>
<FONT color="green">314</FONT>    <a name="line.314"></a>
<FONT color="green">315</FONT>                return null;<a name="line.315"></a>
<FONT color="green">316</FONT>    <a name="line.316"></a>
<FONT color="green">317</FONT>            }<a name="line.317"></a>
<FONT color="green">318</FONT>    <a name="line.318"></a>
<FONT color="green">319</FONT>            /** Get the node containing the next larger or equal element.<a name="line.319"></a>
<FONT color="green">320</FONT>             * @return node containing the next larger or equal element (in<a name="line.320"></a>
<FONT color="green">321</FONT>             * which case the node is guaranteed not to be empty) or null if<a name="line.321"></a>
<FONT color="green">322</FONT>             * there is no larger or equal element in the tree<a name="line.322"></a>
<FONT color="green">323</FONT>             * @see #getPrevious<a name="line.323"></a>
<FONT color="green">324</FONT>             */<a name="line.324"></a>
<FONT color="green">325</FONT>            public Node getNext() {<a name="line.325"></a>
<FONT color="green">326</FONT>    <a name="line.326"></a>
<FONT color="green">327</FONT>                if (right != null) {<a name="line.327"></a>
<FONT color="green">328</FONT>                    final Node node = right.getSmallest();<a name="line.328"></a>
<FONT color="green">329</FONT>                    if (node != null) {<a name="line.329"></a>
<FONT color="green">330</FONT>                        return node;<a name="line.330"></a>
<FONT color="green">331</FONT>                    }<a name="line.331"></a>
<FONT color="green">332</FONT>                }<a name="line.332"></a>
<FONT color="green">333</FONT>    <a name="line.333"></a>
<FONT color="green">334</FONT>                for (Node node = this; node.parent != null; node = node.parent) {<a name="line.334"></a>
<FONT color="green">335</FONT>                    if (node != node.parent.right) {<a name="line.335"></a>
<FONT color="green">336</FONT>                        return node.parent;<a name="line.336"></a>
<FONT color="green">337</FONT>                    }<a name="line.337"></a>
<FONT color="green">338</FONT>                }<a name="line.338"></a>
<FONT color="green">339</FONT>    <a name="line.339"></a>
<FONT color="green">340</FONT>                return null;<a name="line.340"></a>
<FONT color="green">341</FONT>    <a name="line.341"></a>
<FONT color="green">342</FONT>            }<a name="line.342"></a>
<FONT color="green">343</FONT>    <a name="line.343"></a>
<FONT color="green">344</FONT>            /** Insert an element in a sub-tree.<a name="line.344"></a>
<FONT color="green">345</FONT>             * @param newElement element to insert<a name="line.345"></a>
<FONT color="green">346</FONT>             * @return true if the parent tree should be re-Skew.BALANCED<a name="line.346"></a>
<FONT color="green">347</FONT>             */<a name="line.347"></a>
<FONT color="green">348</FONT>            boolean insert(final T newElement) {<a name="line.348"></a>
<FONT color="green">349</FONT>                if (newElement.compareTo(this.element) &lt; 0) {<a name="line.349"></a>
<FONT color="green">350</FONT>                    // the inserted element is smaller than the node<a name="line.350"></a>
<FONT color="green">351</FONT>                    if (left == null) {<a name="line.351"></a>
<FONT color="green">352</FONT>                        left = new Node(newElement, this);<a name="line.352"></a>
<FONT color="green">353</FONT>                        return rebalanceLeftGrown();<a name="line.353"></a>
<FONT color="green">354</FONT>                    }<a name="line.354"></a>
<FONT color="green">355</FONT>                    return left.insert(newElement) ? rebalanceLeftGrown() : false;<a name="line.355"></a>
<FONT color="green">356</FONT>                }<a name="line.356"></a>
<FONT color="green">357</FONT>    <a name="line.357"></a>
<FONT color="green">358</FONT>                // the inserted element is equal to or greater than the node<a name="line.358"></a>
<FONT color="green">359</FONT>                if (right == null) {<a name="line.359"></a>
<FONT color="green">360</FONT>                    right = new Node(newElement, this);<a name="line.360"></a>
<FONT color="green">361</FONT>                    return rebalanceRightGrown();<a name="line.361"></a>
<FONT color="green">362</FONT>                }<a name="line.362"></a>
<FONT color="green">363</FONT>                return right.insert(newElement) ? rebalanceRightGrown() : false;<a name="line.363"></a>
<FONT color="green">364</FONT>    <a name="line.364"></a>
<FONT color="green">365</FONT>            }<a name="line.365"></a>
<FONT color="green">366</FONT>    <a name="line.366"></a>
<FONT color="green">367</FONT>            /** Delete the node from the tree.<a name="line.367"></a>
<FONT color="green">368</FONT>             */<a name="line.368"></a>
<FONT color="green">369</FONT>            public void delete() {<a name="line.369"></a>
<FONT color="green">370</FONT>                if ((parent == null) &amp;&amp; (left == null) &amp;&amp; (right == null)) {<a name="line.370"></a>
<FONT color="green">371</FONT>                    // this was the last node, the tree is now empty<a name="line.371"></a>
<FONT color="green">372</FONT>                    element = null;<a name="line.372"></a>
<FONT color="green">373</FONT>                    top     = null;<a name="line.373"></a>
<FONT color="green">374</FONT>                } else {<a name="line.374"></a>
<FONT color="green">375</FONT>    <a name="line.375"></a>
<FONT color="green">376</FONT>                    Node node;<a name="line.376"></a>
<FONT color="green">377</FONT>                    Node child;<a name="line.377"></a>
<FONT color="green">378</FONT>                    boolean leftShrunk;<a name="line.378"></a>
<FONT color="green">379</FONT>                    if ((left == null) &amp;&amp; (right == null)) {<a name="line.379"></a>
<FONT color="green">380</FONT>                        node       = this;<a name="line.380"></a>
<FONT color="green">381</FONT>                        element    = null;<a name="line.381"></a>
<FONT color="green">382</FONT>                        leftShrunk = node == node.parent.left;<a name="line.382"></a>
<FONT color="green">383</FONT>                        child      = null;<a name="line.383"></a>
<FONT color="green">384</FONT>                    } else {<a name="line.384"></a>
<FONT color="green">385</FONT>                        node       = (left != null) ? left.getLargest() : right.getSmallest();<a name="line.385"></a>
<FONT color="green">386</FONT>                        element    = node.element;<a name="line.386"></a>
<FONT color="green">387</FONT>                        leftShrunk = node == node.parent.left;<a name="line.387"></a>
<FONT color="green">388</FONT>                        child      = (node.left != null) ? node.left : node.right;<a name="line.388"></a>
<FONT color="green">389</FONT>                    }<a name="line.389"></a>
<FONT color="green">390</FONT>    <a name="line.390"></a>
<FONT color="green">391</FONT>                    node = node.parent;<a name="line.391"></a>
<FONT color="green">392</FONT>                    if (leftShrunk) {<a name="line.392"></a>
<FONT color="green">393</FONT>                        node.left = child;<a name="line.393"></a>
<FONT color="green">394</FONT>                    } else {<a name="line.394"></a>
<FONT color="green">395</FONT>                        node.right = child;<a name="line.395"></a>
<FONT color="green">396</FONT>                    }<a name="line.396"></a>
<FONT color="green">397</FONT>                    if (child != null) {<a name="line.397"></a>
<FONT color="green">398</FONT>                        child.parent = node;<a name="line.398"></a>
<FONT color="green">399</FONT>                    }<a name="line.399"></a>
<FONT color="green">400</FONT>    <a name="line.400"></a>
<FONT color="green">401</FONT>                    while (leftShrunk ? node.rebalanceLeftShrunk() : node.rebalanceRightShrunk()) {<a name="line.401"></a>
<FONT color="green">402</FONT>                        if (node.parent == null) {<a name="line.402"></a>
<FONT color="green">403</FONT>                            return;<a name="line.403"></a>
<FONT color="green">404</FONT>                        }<a name="line.404"></a>
<FONT color="green">405</FONT>                        leftShrunk = node == node.parent.left;<a name="line.405"></a>
<FONT color="green">406</FONT>                        node = node.parent;<a name="line.406"></a>
<FONT color="green">407</FONT>                    }<a name="line.407"></a>
<FONT color="green">408</FONT>    <a name="line.408"></a>
<FONT color="green">409</FONT>                }<a name="line.409"></a>
<FONT color="green">410</FONT>            }<a name="line.410"></a>
<FONT color="green">411</FONT>    <a name="line.411"></a>
<FONT color="green">412</FONT>            /** Re-balance the instance as left sub-tree has grown.<a name="line.412"></a>
<FONT color="green">413</FONT>             * @return true if the parent tree should be reSkew.BALANCED too<a name="line.413"></a>
<FONT color="green">414</FONT>             */<a name="line.414"></a>
<FONT color="green">415</FONT>            private boolean rebalanceLeftGrown() {<a name="line.415"></a>
<FONT color="green">416</FONT>                switch (skew) {<a name="line.416"></a>
<FONT color="green">417</FONT>                case LEFT_HIGH:<a name="line.417"></a>
<FONT color="green">418</FONT>                    if (left.skew == Skew.LEFT_HIGH) {<a name="line.418"></a>
<FONT color="green">419</FONT>                        rotateCW();<a name="line.419"></a>
<FONT color="green">420</FONT>                        skew       = Skew.BALANCED;<a name="line.420"></a>
<FONT color="green">421</FONT>                        right.skew = Skew.BALANCED;<a name="line.421"></a>
<FONT color="green">422</FONT>                    } else {<a name="line.422"></a>
<FONT color="green">423</FONT>                        final Skew s = left.right.skew;<a name="line.423"></a>
<FONT color="green">424</FONT>                        left.rotateCCW();<a name="line.424"></a>
<FONT color="green">425</FONT>                        rotateCW();<a name="line.425"></a>
<FONT color="green">426</FONT>                        switch(s) {<a name="line.426"></a>
<FONT color="green">427</FONT>                        case LEFT_HIGH:<a name="line.427"></a>
<FONT color="green">428</FONT>                            left.skew  = Skew.BALANCED;<a name="line.428"></a>
<FONT color="green">429</FONT>                            right.skew = Skew.RIGHT_HIGH;<a name="line.429"></a>
<FONT color="green">430</FONT>                            break;<a name="line.430"></a>
<FONT color="green">431</FONT>                        case RIGHT_HIGH:<a name="line.431"></a>
<FONT color="green">432</FONT>                            left.skew  = Skew.LEFT_HIGH;<a name="line.432"></a>
<FONT color="green">433</FONT>                            right.skew = Skew.BALANCED;<a name="line.433"></a>
<FONT color="green">434</FONT>                            break;<a name="line.434"></a>
<FONT color="green">435</FONT>                        default:<a name="line.435"></a>
<FONT color="green">436</FONT>                            left.skew  = Skew.BALANCED;<a name="line.436"></a>
<FONT color="green">437</FONT>                            right.skew = Skew.BALANCED;<a name="line.437"></a>
<FONT color="green">438</FONT>                        }<a name="line.438"></a>
<FONT color="green">439</FONT>                        skew = Skew.BALANCED;<a name="line.439"></a>
<FONT color="green">440</FONT>                    }<a name="line.440"></a>
<FONT color="green">441</FONT>                    return false;<a name="line.441"></a>
<FONT color="green">442</FONT>                case RIGHT_HIGH:<a name="line.442"></a>
<FONT color="green">443</FONT>                    skew = Skew.BALANCED;<a name="line.443"></a>
<FONT color="green">444</FONT>                    return false;<a name="line.444"></a>
<FONT color="green">445</FONT>                default:<a name="line.445"></a>
<FONT color="green">446</FONT>                    skew = Skew.LEFT_HIGH;<a name="line.446"></a>
<FONT color="green">447</FONT>                    return true;<a name="line.447"></a>
<FONT color="green">448</FONT>                }<a name="line.448"></a>
<FONT color="green">449</FONT>            }<a name="line.449"></a>
<FONT color="green">450</FONT>    <a name="line.450"></a>
<FONT color="green">451</FONT>            /** Re-balance the instance as right sub-tree has grown.<a name="line.451"></a>
<FONT color="green">452</FONT>             * @return true if the parent tree should be reSkew.BALANCED too<a name="line.452"></a>
<FONT color="green">453</FONT>             */<a name="line.453"></a>
<FONT color="green">454</FONT>            private boolean rebalanceRightGrown() {<a name="line.454"></a>
<FONT color="green">455</FONT>                switch (skew) {<a name="line.455"></a>
<FONT color="green">456</FONT>                case LEFT_HIGH:<a name="line.456"></a>
<FONT color="green">457</FONT>                    skew = Skew.BALANCED;<a name="line.457"></a>
<FONT color="green">458</FONT>                    return false;<a name="line.458"></a>
<FONT color="green">459</FONT>                case RIGHT_HIGH:<a name="line.459"></a>
<FONT color="green">460</FONT>                    if (right.skew == Skew.RIGHT_HIGH) {<a name="line.460"></a>
<FONT color="green">461</FONT>                        rotateCCW();<a name="line.461"></a>
<FONT color="green">462</FONT>                        skew      = Skew.BALANCED;<a name="line.462"></a>
<FONT color="green">463</FONT>                        left.skew = Skew.BALANCED;<a name="line.463"></a>
<FONT color="green">464</FONT>                    } else {<a name="line.464"></a>
<FONT color="green">465</FONT>                        final Skew s = right.left.skew;<a name="line.465"></a>
<FONT color="green">466</FONT>                        right.rotateCW();<a name="line.466"></a>
<FONT color="green">467</FONT>                        rotateCCW();<a name="line.467"></a>
<FONT color="green">468</FONT>                        switch (s) {<a name="line.468"></a>
<FONT color="green">469</FONT>                        case LEFT_HIGH:<a name="line.469"></a>
<FONT color="green">470</FONT>                            left.skew  = Skew.BALANCED;<a name="line.470"></a>
<FONT color="green">471</FONT>                            right.skew = Skew.RIGHT_HIGH;<a name="line.471"></a>
<FONT color="green">472</FONT>                            break;<a name="line.472"></a>
<FONT color="green">473</FONT>                        case RIGHT_HIGH:<a name="line.473"></a>
<FONT color="green">474</FONT>                            left.skew  = Skew.LEFT_HIGH;<a name="line.474"></a>
<FONT color="green">475</FONT>                            right.skew = Skew.BALANCED;<a name="line.475"></a>
<FONT color="green">476</FONT>                            break;<a name="line.476"></a>
<FONT color="green">477</FONT>                        default:<a name="line.477"></a>
<FONT color="green">478</FONT>                            left.skew  = Skew.BALANCED;<a name="line.478"></a>
<FONT color="green">479</FONT>                            right.skew = Skew.BALANCED;<a name="line.479"></a>
<FONT color="green">480</FONT>                        }<a name="line.480"></a>
<FONT color="green">481</FONT>                        skew = Skew.BALANCED;<a name="line.481"></a>
<FONT color="green">482</FONT>                    }<a name="line.482"></a>
<FONT color="green">483</FONT>                    return false;<a name="line.483"></a>
<FONT color="green">484</FONT>                default:<a name="line.484"></a>
<FONT color="green">485</FONT>                    skew = Skew.RIGHT_HIGH;<a name="line.485"></a>
<FONT color="green">486</FONT>                    return true;<a name="line.486"></a>
<FONT color="green">487</FONT>                }<a name="line.487"></a>
<FONT color="green">488</FONT>            }<a name="line.488"></a>
<FONT color="green">489</FONT>    <a name="line.489"></a>
<FONT color="green">490</FONT>            /** Re-balance the instance as left sub-tree has shrunk.<a name="line.490"></a>
<FONT color="green">491</FONT>             * @return true if the parent tree should be reSkew.BALANCED too<a name="line.491"></a>
<FONT color="green">492</FONT>             */<a name="line.492"></a>
<FONT color="green">493</FONT>            private boolean rebalanceLeftShrunk() {<a name="line.493"></a>
<FONT color="green">494</FONT>                switch (skew) {<a name="line.494"></a>
<FONT color="green">495</FONT>                case LEFT_HIGH:<a name="line.495"></a>
<FONT color="green">496</FONT>                    skew = Skew.BALANCED;<a name="line.496"></a>
<FONT color="green">497</FONT>                    return true;<a name="line.497"></a>
<FONT color="green">498</FONT>                case RIGHT_HIGH:<a name="line.498"></a>
<FONT color="green">499</FONT>                    if (right.skew == Skew.RIGHT_HIGH) {<a name="line.499"></a>
<FONT color="green">500</FONT>                        rotateCCW();<a name="line.500"></a>
<FONT color="green">501</FONT>                        skew      = Skew.BALANCED;<a name="line.501"></a>
<FONT color="green">502</FONT>                        left.skew = Skew.BALANCED;<a name="line.502"></a>
<FONT color="green">503</FONT>                        return true;<a name="line.503"></a>
<FONT color="green">504</FONT>                    } else if (right.skew == Skew.BALANCED) {<a name="line.504"></a>
<FONT color="green">505</FONT>                        rotateCCW();<a name="line.505"></a>
<FONT color="green">506</FONT>                        skew      = Skew.LEFT_HIGH;<a name="line.506"></a>
<FONT color="green">507</FONT>                        left.skew = Skew.RIGHT_HIGH;<a name="line.507"></a>
<FONT color="green">508</FONT>                        return false;<a name="line.508"></a>
<FONT color="green">509</FONT>                    } else {<a name="line.509"></a>
<FONT color="green">510</FONT>                        final Skew s = right.left.skew;<a name="line.510"></a>
<FONT color="green">511</FONT>                        right.rotateCW();<a name="line.511"></a>
<FONT color="green">512</FONT>                        rotateCCW();<a name="line.512"></a>
<FONT color="green">513</FONT>                        switch (s) {<a name="line.513"></a>
<FONT color="green">514</FONT>                        case LEFT_HIGH:<a name="line.514"></a>
<FONT color="green">515</FONT>                            left.skew  = Skew.BALANCED;<a name="line.515"></a>
<FONT color="green">516</FONT>                            right.skew = Skew.RIGHT_HIGH;<a name="line.516"></a>
<FONT color="green">517</FONT>                            break;<a name="line.517"></a>
<FONT color="green">518</FONT>                        case RIGHT_HIGH:<a name="line.518"></a>
<FONT color="green">519</FONT>                            left.skew  = Skew.LEFT_HIGH;<a name="line.519"></a>
<FONT color="green">520</FONT>                            right.skew = Skew.BALANCED;<a name="line.520"></a>
<FONT color="green">521</FONT>                            break;<a name="line.521"></a>
<FONT color="green">522</FONT>                        default:<a name="line.522"></a>
<FONT color="green">523</FONT>                            left.skew  = Skew.BALANCED;<a name="line.523"></a>
<FONT color="green">524</FONT>                            right.skew = Skew.BALANCED;<a name="line.524"></a>
<FONT color="green">525</FONT>                        }<a name="line.525"></a>
<FONT color="green">526</FONT>                        skew = Skew.BALANCED;<a name="line.526"></a>
<FONT color="green">527</FONT>                        return true;<a name="line.527"></a>
<FONT color="green">528</FONT>                    }<a name="line.528"></a>
<FONT color="green">529</FONT>                default:<a name="line.529"></a>
<FONT color="green">530</FONT>                    skew = Skew.RIGHT_HIGH;<a name="line.530"></a>
<FONT color="green">531</FONT>                    return false;<a name="line.531"></a>
<FONT color="green">532</FONT>                }<a name="line.532"></a>
<FONT color="green">533</FONT>            }<a name="line.533"></a>
<FONT color="green">534</FONT>    <a name="line.534"></a>
<FONT color="green">535</FONT>            /** Re-balance the instance as right sub-tree has shrunk.<a name="line.535"></a>
<FONT color="green">536</FONT>             * @return true if the parent tree should be reSkew.BALANCED too<a name="line.536"></a>
<FONT color="green">537</FONT>             */<a name="line.537"></a>
<FONT color="green">538</FONT>            private boolean rebalanceRightShrunk() {<a name="line.538"></a>
<FONT color="green">539</FONT>                switch (skew) {<a name="line.539"></a>
<FONT color="green">540</FONT>                case RIGHT_HIGH:<a name="line.540"></a>
<FONT color="green">541</FONT>                    skew = Skew.BALANCED;<a name="line.541"></a>
<FONT color="green">542</FONT>                    return true;<a name="line.542"></a>
<FONT color="green">543</FONT>                case LEFT_HIGH:<a name="line.543"></a>
<FONT color="green">544</FONT>                    if (left.skew == Skew.LEFT_HIGH) {<a name="line.544"></a>
<FONT color="green">545</FONT>                        rotateCW();<a name="line.545"></a>
<FONT color="green">546</FONT>                        skew       = Skew.BALANCED;<a name="line.546"></a>
<FONT color="green">547</FONT>                        right.skew = Skew.BALANCED;<a name="line.547"></a>
<FONT color="green">548</FONT>                        return true;<a name="line.548"></a>
<FONT color="green">549</FONT>                    } else if (left.skew == Skew.BALANCED) {<a name="line.549"></a>
<FONT color="green">550</FONT>                        rotateCW();<a name="line.550"></a>
<FONT color="green">551</FONT>                        skew       = Skew.RIGHT_HIGH;<a name="line.551"></a>
<FONT color="green">552</FONT>                        right.skew = Skew.LEFT_HIGH;<a name="line.552"></a>
<FONT color="green">553</FONT>                        return false;<a name="line.553"></a>
<FONT color="green">554</FONT>                    } else {<a name="line.554"></a>
<FONT color="green">555</FONT>                        final Skew s = left.right.skew;<a name="line.555"></a>
<FONT color="green">556</FONT>                        left.rotateCCW();<a name="line.556"></a>
<FONT color="green">557</FONT>                        rotateCW();<a name="line.557"></a>
<FONT color="green">558</FONT>                        switch (s) {<a name="line.558"></a>
<FONT color="green">559</FONT>                        case LEFT_HIGH:<a name="line.559"></a>
<FONT color="green">560</FONT>                            left.skew  = Skew.BALANCED;<a name="line.560"></a>
<FONT color="green">561</FONT>                            right.skew = Skew.RIGHT_HIGH;<a name="line.561"></a>
<FONT color="green">562</FONT>                            break;<a name="line.562"></a>
<FONT color="green">563</FONT>                        case RIGHT_HIGH:<a name="line.563"></a>
<FONT color="green">564</FONT>                            left.skew  = Skew.LEFT_HIGH;<a name="line.564"></a>
<FONT color="green">565</FONT>                            right.skew = Skew.BALANCED;<a name="line.565"></a>
<FONT color="green">566</FONT>                            break;<a name="line.566"></a>
<FONT color="green">567</FONT>                        default:<a name="line.567"></a>
<FONT color="green">568</FONT>                            left.skew  = Skew.BALANCED;<a name="line.568"></a>
<FONT color="green">569</FONT>                            right.skew = Skew.BALANCED;<a name="line.569"></a>
<FONT color="green">570</FONT>                        }<a name="line.570"></a>
<FONT color="green">571</FONT>                        skew = Skew.BALANCED;<a name="line.571"></a>
<FONT color="green">572</FONT>                        return true;<a name="line.572"></a>
<FONT color="green">573</FONT>                    }<a name="line.573"></a>
<FONT color="green">574</FONT>                default:<a name="line.574"></a>
<FONT color="green">575</FONT>                    skew = Skew.LEFT_HIGH;<a name="line.575"></a>
<FONT color="green">576</FONT>                    return false;<a name="line.576"></a>
<FONT color="green">577</FONT>                }<a name="line.577"></a>
<FONT color="green">578</FONT>            }<a name="line.578"></a>
<FONT color="green">579</FONT>    <a name="line.579"></a>
<FONT color="green">580</FONT>            /** Perform a clockwise rotation rooted at the instance.<a name="line.580"></a>
<FONT color="green">581</FONT>             * &lt;p&gt;The skew factor are not updated by this method, they<a name="line.581"></a>
<FONT color="green">582</FONT>             * &lt;em&gt;must&lt;/em&gt; be updated by the caller&lt;/p&gt;<a name="line.582"></a>
<FONT color="green">583</FONT>             */<a name="line.583"></a>
<FONT color="green">584</FONT>            private void rotateCW() {<a name="line.584"></a>
<FONT color="green">585</FONT>    <a name="line.585"></a>
<FONT color="green">586</FONT>                final T tmpElt       = element;<a name="line.586"></a>
<FONT color="green">587</FONT>                element              = left.element;<a name="line.587"></a>
<FONT color="green">588</FONT>                left.element         = tmpElt;<a name="line.588"></a>
<FONT color="green">589</FONT>    <a name="line.589"></a>
<FONT color="green">590</FONT>                final Node tmpNode   = left;<a name="line.590"></a>
<FONT color="green">591</FONT>                left                 = tmpNode.left;<a name="line.591"></a>
<FONT color="green">592</FONT>                tmpNode.left         = tmpNode.right;<a name="line.592"></a>
<FONT color="green">593</FONT>                tmpNode.right        = right;<a name="line.593"></a>
<FONT color="green">594</FONT>                right                = tmpNode;<a name="line.594"></a>
<FONT color="green">595</FONT>    <a name="line.595"></a>
<FONT color="green">596</FONT>                if (left != null) {<a name="line.596"></a>
<FONT color="green">597</FONT>                    left.parent = this;<a name="line.597"></a>
<FONT color="green">598</FONT>                }<a name="line.598"></a>
<FONT color="green">599</FONT>                if (right.right != null) {<a name="line.599"></a>
<FONT color="green">600</FONT>                    right.right.parent = right;<a name="line.600"></a>
<FONT color="green">601</FONT>                }<a name="line.601"></a>
<FONT color="green">602</FONT>    <a name="line.602"></a>
<FONT color="green">603</FONT>            }<a name="line.603"></a>
<FONT color="green">604</FONT>    <a name="line.604"></a>
<FONT color="green">605</FONT>            /** Perform a counter-clockwise rotation rooted at the instance.<a name="line.605"></a>
<FONT color="green">606</FONT>             * &lt;p&gt;The skew factor are not updated by this method, they<a name="line.606"></a>
<FONT color="green">607</FONT>             * &lt;em&gt;must&lt;/em&gt; be updated by the caller&lt;/p&gt;<a name="line.607"></a>
<FONT color="green">608</FONT>             */<a name="line.608"></a>
<FONT color="green">609</FONT>            private void rotateCCW() {<a name="line.609"></a>
<FONT color="green">610</FONT>    <a name="line.610"></a>
<FONT color="green">611</FONT>                final T tmpElt        = element;<a name="line.611"></a>
<FONT color="green">612</FONT>                element               = right.element;<a name="line.612"></a>
<FONT color="green">613</FONT>                right.element         = tmpElt;<a name="line.613"></a>
<FONT color="green">614</FONT>    <a name="line.614"></a>
<FONT color="green">615</FONT>                final Node tmpNode    = right;<a name="line.615"></a>
<FONT color="green">616</FONT>                right                 = tmpNode.right;<a name="line.616"></a>
<FONT color="green">617</FONT>                tmpNode.right         = tmpNode.left;<a name="line.617"></a>
<FONT color="green">618</FONT>                tmpNode.left          = left;<a name="line.618"></a>
<FONT color="green">619</FONT>                left                  = tmpNode;<a name="line.619"></a>
<FONT color="green">620</FONT>    <a name="line.620"></a>
<FONT color="green">621</FONT>                if (right != null) {<a name="line.621"></a>
<FONT color="green">622</FONT>                    right.parent = this;<a name="line.622"></a>
<FONT color="green">623</FONT>                }<a name="line.623"></a>
<FONT color="green">624</FONT>                if (left.left != null) {<a name="line.624"></a>
<FONT color="green">625</FONT>                    left.left.parent = left;<a name="line.625"></a>
<FONT color="green">626</FONT>                }<a name="line.626"></a>
<FONT color="green">627</FONT>    <a name="line.627"></a>
<FONT color="green">628</FONT>            }<a name="line.628"></a>
<FONT color="green">629</FONT>    <a name="line.629"></a>
<FONT color="green">630</FONT>        }<a name="line.630"></a>
<FONT color="green">631</FONT>    <a name="line.631"></a>
<FONT color="green">632</FONT>    }<a name="line.632"></a>




























































</PRE>
</BODY>
</HTML>
